Publications: Partial Order Model Checking

Model Checking with the Partial Order Reduction

Combining Partial

Partial order based reduction techniques to reduce time and memory in model-checking procedures are becoming quite popular. Partial order reduction techniques exploit the independence of actions. Symmetry based reduction techniques exploit the inherent structure of the system to reduce the state space explored during model checking. We provide an abstract framework for combining partial-order a...

Combining Partial Order Reduction with Bounded Model Checking

Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...

Partial - Order Reduction in theWeak Modal Mu -

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concur-rency Factory speciication and veriication environment; experimental results show that partial-order reduction can be highly eeective in combating state explosion in modal mu-calculus model c...

An improvement in partial-order model-checking with ample sets

In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking.